Curve matching on brain surfaces using frenet distances
نویسندگان
چکیده
منابع مشابه
Computing Distances between Surfaces Using Line Geometry
We present an algorithm for computing the distance between two free-form surfaces. Using line geometry, the distance computation is reformulated as a simple instance of a surface-surface intersection problem, which leads to lowdimensional root finding in a system of equations. This approach produces an efficient algorithm for computing the distance between two ellipsoids, where the problem is r...
متن کاملIndirect illumination on curve surfaces
In this paper we suggest improved method of photon registration on curve surfaces, presented by triangulated mesh with “true” normals in mesh vertices. Such presentation is widely used for simulation the differing effects of light and color across the surface of an object (Phong shading). It was found that direct photon registration, which does not take into account interpolated (smooth) normal...
متن کاملOn Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of pieces in two stages, one based on a coarse-scale representation of curves and one based on a fine-scale elastic curve matching method. This re-examination of the top coarse-scale matches at the fine scale results in an opt...
متن کاملTracking Point-Curve Critical Distances
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R to a static parametrized piecewise rational curve γ(s) (s ∈ R). The approach is a combination of local marching, and the detection and computation of global topological change, both based on the differential properties of a ...
متن کاملCurve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Sethian’s Fast Marching Method to find the solution with sub-resolution accuracy and in consistence with the underlying continuous problem. We demonstrate how the method may be applied to compare closed curves, morph one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Human Brain Mapping
سال: 1998
ISSN: 1065-9471
DOI: 10.1002/(sici)1097-0193(1998)6:5/6<329::aid-hbm1>3.0.co;2-x